Case Retrieval Nets: Basic Ideas and Extensions
نویسندگان
چکیده
An eecient retrieval of a relatively small number of relevant cases from a huge case base is a crucial subtask of Case-Based Reasoning (CBR). In this article, we present Case Retrieval Nets, a memory model that has recently been developed for this task. The main idea is to apply a spreading activation process to the case memory structured as a Case Retrieval Net in order to retrieve cases being suuciently similar to a posed query case. This article summarizes the basic ideas of Case Retrieval Nets and suggests some useful extensions.
منابع مشابه
The Incremental Modelling of the Z39.50 Protocol with Object Petri Nets
This paper examines how object-oriented extensions to the Petri Net formalism provide flexible structuring primitives which can aid the modelling of network protocols. A key benefit is the support for incremental modelling. As a result, a protocol can be modelled as a collection of services, each of which can be expressed as the enhancement of a basic service, in which case, both the structure ...
متن کاملUtilizing Connectionist Learning Procedures in Symbolic Case Retrieval Nets
This paper describes a method which, under certain circumstances, allows to automatically learn or adjust similarity measures. For this, ideas of connectionist learning procedures, in particular those related to Hebbian learning, are combined with a Case-Based Reasoning engine.
متن کاملRewriting Logic as a Unifying Framework for Petri Nets
We propose rewriting logic as a unifying framework for a wide range of Petri nets models. We treat in detail place/transition nets and important extensions of the basic model by individual tokens, test arcs, and time. Based on the idea that “Petri nets are monoids” suggested by Meseguer and Montanari we define a rewriting semantics that maps place/transition nets into rewriting logic specificat...
متن کاملFrontiers in OR/MS Track: Session I PETRI NETS – TUTORIAL AND APPLICATIONS
Petri nets are graphical and mathematical tools for studying discrete event systems. Petri nets have been under extensive development since Petri defined the language in 1962. Various extensions of Petri nets have been developed to study concurrent, asynchronous, distributed, parallel, deterministic, and stochastic system behavior. This paper provides a quick tutorial to learn the basic termino...
متن کاملReset nets between decidability
We study Petri nets with Reset arcs (also Transfer and Doubling arcs) in combination with other extensions of the basic Petri net model. While Reachability is undecidable in all these extensions (indeed they are Turing-powerful), we exhibit unexpected frontiers for the decid-ability of Termination, Coverability, Boundedness and place-Boundedness. In particular, we show counter-intuitive separat...
متن کامل